Wavelet Monte Carlo: a principle for sampling from complex distributions
نویسندگان
چکیده
Abstract We present Wavelet Monte Carlo (WMC), a new method for generating independent samples from complex target distributions. The methodology is based on wavelet decomposition of the difference between density and user-specified initial density, exploits both theory survival analysis. In practice, WMC can process only finite range scales. prove that resulting $$L_1$$ L 1 approximation error converges to zero geometrically as scale tends $$(-\infty ,+\infty )$$ ( - ∞ , + ) . This provides principled approach trading off accuracy against computational efficiency. offer practical suggestions addressing some issues implementation, but further development needed computationally efficient methodology. illustrate in one- two-dimensional examples, discuss challenges opportunities application higher dimensions.
منابع مشابه
Hamiltonian Monte Carlo sampling for Wishart distributions with eigenvalue constraints
Sampling from constrained target spaces for Bayesian inference is a non-trivial problem. A recent development has been the use of Hamiltonian Monte Carlo in combination with particle re ection, see [Pakman and Paninski, 2014]. However, Hamiltonian Monte Carlo is sensitive to several hyper parameters, that need to be tuned, to ensure an ecient sampler. For this purpose, [Wang et al., 2013] sugge...
متن کاملComparison of measured and Monte Carlo calculated dose distributions from “circular collimators” for radiosurgical beams
Background: Stereotactic radiosurgery is an important clinical tool for the treatment of small lesions in the brain, including benign conditions, malignant and localized metastatic tumors. A dosimetry study was performed for Elekta ‘Synergy S ’ as a dedicated Stereotactic radiosurgery unit, capable of generating circular radiation fields with diameters of 1-5 cm at isocentre using the BEAM/EGS4...
متن کاملA Monte Carlo Metropolis-Hastings Algorithm for Sampling from Distributions with Intractable Normalizing Constants
Simulating from distributions with intractable normalizing constants has been a long-standing problem in machine learning. In this letter, we propose a new algorithm, the Monte Carlo Metropolis-Hastings (MCMH) algorithm, for tackling this problem. The MCMH algorithm is a Monte Carlo version of the Metropolis-Hastings algorithm. It replaces the unknown normalizing constant ratio by a Monte Carlo...
متن کاملAutomatic Markov chain Monte Carlo Procedures for Sampling from Multivariate Distributions
Generating samples from multivariate distributions efficiently is an important task in Monte Carlo integration and many other stochastic simulation problems. Markov chain Monte Carlo has been shown to be very efficient compared to “conventional methods”, especially when many dimensions are involved. In this article we propose a Hit-and-Run sampler in combination with the Ratio-of-Uniforms metho...
متن کاملNew Physical Principle for Monte-Carlo simulations
Abstract: New physical principle for Monte-Carlo simulations has been introduced. It is based upon coupling of dynamical equations and the corresponding Liouville equation. The proposed approach does not require a random number generator since randomness is generated by instability of dynamics triggered and controlled by the feedback from the Liouville equation. Direct simulation of evolutionar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2023
ISSN: ['0960-3174', '1573-1375']
DOI: https://doi.org/10.1007/s11222-023-10256-w